Feature Scaling via Second-Order Cone Programming
نویسندگان
چکیده
منابع مشابه
Second-order cone programming
Second-order cone programming (SOCP) problems are convex optimization problems in which a linear function is minimized over the intersection of an affine linear manifold with the Cartesian product of second-order (Lorentz) cones. Linear programs, convex quadratic programs and quadratically constrained convex quadratic programs can all be formulated as SOCP problems, as can many other problems t...
متن کاملSecond Order Cone Programming Formulations for Feature Selection
This paper addresses the issue of feature selection for linear classifiers given the moments of the class conditional densities. The problem is posed as finding a minimal set of features such that the resulting classifier has a low misclassification error. Using a bound on the misclassification error involving the mean and covariance of class conditional densities and minimizing an L1 norm as a...
متن کاملWaveform Design using Second Order Cone Programming in Radar Systems
Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...
متن کاملSemidefinite and Second Order Cone Programming
1 Overview We survey the basic notions of cones and cone-LP and give several examples mostly related to semidefinite programming. The linear and semidefinite programming problems are formulated as follows: Let c ∈ n and b ∈ m ,A ∈ n×m with rows a i ∈
متن کاملSemidefinite and Second Order Cone Programming Seminar
Image is represented by an undirected weighted graph G = (V, E) where vertices i ∈ V = {1, . . . , n} correspond to image features, and edges (i, j) ∈ E have weights w(i, j) : V × V 7→ R that reflect pairwise similarity between features. To segment an image, we wish to partition nodes V into two disjoint coherent sets S and S̄ = V \ S. This means that edges within the same set should have high w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2016
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2016/7347986